利用矩阵求极大相容类的一种方法

寻找相容关系的极大相容类和简单图的极大完全子图，在解决二元关系与数据挖掘和管理决策中的具体问题时有重要作用。利用相容关系的极大相容类与简单图的极大完全子图之间的对应关系，对极大完全子图的路径长度进行分析，得到了关于极大完全子图路径长度的一个定理。并根据该定理构造了一个用矩阵的路径长度搜索简单图的极大完全子图的方法，进而利用该方法找出了对应相容关系的极大相容类。     

复杂约束下的导弹作战任务规划模型和算法研究*

导弹作战任务规划是一个涉及时间、资源、质量和其他关系约束的复杂问题.首先通过定叉约束满足效用对基本约束满足模型进行了扩展,建立了导弹任务规划的约束满足优化模型.在此基础上,研究了任务规划模型求解的时间和效用传播算法,提出了基于综合效用的优化求解框架.该模型和求解框架易于解决具有多种约束因素的复杂问题,具有较好的通用性.通过定义软、硬约束效用,使得实际任务规划问题求解具有更好的灵活性.     

武警部队快速机动中最优路径的实现

紧急条件下武警部队快速机动最优路径，是一个多目标多约束随机动态交通网络寻优问题。在分析交通网络拓扑化特点及最短路模型前提下，着重研究道路通行能力带给复杂公路网络道路寻优问题的影响，并结合GIS系统利用改进的Dijkstra算法求解。     

Disaster management in case of CBRNe events: an innovative methodology to improve the safety knowledge of advisors and first responders

Nowadays, Chemical-Biological-Radiological-Nuclear-explosive (CBRNe) risks are one of the world's main safety concerns. The radiological disasters of Fukushima and Chernobyl, the chemical events of Seveso or the release of Sarin in the Tokyo Subway, the biological emergencies such as the H1N1 flu or the recent Ebola outbreak, and recent news about the availability of non-conventional weapons acquired by fundamentalist organisations represent evidence of potential future threats. CBRNe risks are a real and global threat. The University of Rome, Tor Vergata, in collaboration with the most important Italian and international bodies working in the field of CBRNe safety and security, and supported by the North Atlantic Treaty Organisation and the Organisation for the Prohibition of Chemical Weapons, organises International Masters Courses on the Protection against CBRNe events. Within this framework, a Table-Top Exercise was planned, in collaboration with the Italian Ministry of Interior and Ministry of Defence. The scenario, the logistic organisation, on-going adjustments during the exercise and the outcomes are presented here and analysed.     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

空间站零燃料大角度姿态机动路径存在性分析

零燃料大角度姿态机动技术是新近应用在国际空间站的新概念姿态控制技术。构造了以控制力矩陀螺为执行机构的空间站姿态控制动力学模型,在此基础上,建立了空间站本体与控制力矩陀螺之间的角动量守恒关系。针对各类大角度姿态机动任务,通过分析空间站惯量参数与控制力矩陀螺性能参数之间的解析关系,得到了零燃料大角度姿态机动路径的存在性条件。通过规划算例验证了存在性分析的正确性。所提出的零燃料大角度姿态机动存在性条件,为姿态机动路径的存在性判断提供了便捷可行的方法,为零燃料大角度姿态机动技术未来在我国空间站实施的可行性论证提供重要的理论依据。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

STK飞行任务仿真及其在空地链路分析中的应用

飞行仿真是飞行航路设计,飞行任务规划以及飞行训练等项目中非常重要的一项任务。介绍了在STK(Satellite Tool Kit)的三维显示环境下,利用STK提供的专业化模块STK/AMM(Aircraft Mission Modeler)进行航空器飞行任务仿真的方法,详细阐述了利用该模块进行飞行任务规划和飞行路径设计的过程。同时结合STK的数据分析功能完成航空器在飞行过程中与地面台站的通信链路的可用性分析。给出的仿真方法较以往的仿真方法简单,设计过程更加灵活,可以快速地实现飞行任务仿真设计和空地通信链路的可用性分析。     

敏捷成像卫星自主规划模型与算法

针对敏捷成像卫星自主规划问题,将规划、决策、执行和信息反馈相结合,提出星上自主规划框架,并介绍框架结构和模块功能。在分析主要约束条件的基础上,建立基于时间线约束网络的问题模型。通过将各种卫星动作前后衔接,组合成能够完成不同任务的动作序列,提出一种面向卫星动作序列的启发式算法。该算法分为规划和决策两个部分,并在卫星执行每一个动作序列的同时基于多种启发式规则进行规划,在动作序列执行结束时进行决策。实验结果表明了自主规划框架和模型的合理性以及算法的有效性。